UMRAO: A Chess Endgame Tutor
نویسندگان
چکیده
Most research in computer chess has focussed on creating an excellent chess player, with relatively little concern given to modelling how humans play chess. The research reported in this paper is aimed at investigating knowledge-based chess in the context of building a prototype chess tutor, UMRAO, which helps students learn how to play bishop-pawn endgames. In tutoring it is essential to take a knowledge-based approach, since students must learn how to manipulate strategic concepts, not how to carry out minimax search. UMRAO uses an extension of Michic's advice language to represent expert and novice chess plans. For any given endgame the system is able to compile the plans into a strategy graph, which elaborates strategies (both well-formed and ill-formed) that students might use as they solve the endgame problem. Strategy graphs can be compiled "off-line" so that they can be used in real time tutoring. We show that the normally r igid "model tracing" tutoring paradigm can be used in a flexible way in this domain.
منابع مشابه
Conflict Resolution of Chinese Chess Endgame Knowledge Base
Endgame heuristics are often incorperated as part of the evaluation function used in Chinese chess programs. In our program, Contemplation, we have proposed an automatic strategy to construct a large set of endgame heuristics. In this paper, we propose a conflict resolution strategy to eliminate the conflicts among the constructed heuristic database, which is called endgame knowledge base. In o...
متن کاملProving Correctness of a KRK Chess Endgame Strategy by SAT-based Constraint Solving
Chess endgame strategies in a concise and intuitive way describe the rules the player should follow to ensure win (or draw). Endgame strategies are useful for both computer and human players. Their correctness can be proved in several ways, and in this paper we present one of them: computer assisted proof based on reduction to propositional logic, more precisely to SAT. We focus on a strategy f...
متن کاملGP-EndChess: Using Genetic Programming to Evolve Chess Endgame Players
We apply genetic programming to the evolution of strategies for playing chess endgames. Our evolved programs are able to draw or win against an expert human-based strategy, and draw against CRAFTY—a world-class chess program, which finished second in the 2004 Computer Chess Championship.
متن کاملChess Endgames: Data and Strategy
While Nalimov’s endgame tables for Western Chess are the most used today, their Depth-to-Mate metric is not the only one and not the most effective in use. The authors have developed and used new programs to create tables to alternative metrics and recommend better strategies for endgame play.
متن کاملChinese Dark Chess
Chinese dark chess is a popular and easy-to-learn game in Asia. The characteristic of possible revealing of unknown pieces makes it different from Chinese chess or Western chess. Players with luck may win a game by chance. Thus, there is a probabilistic behavior that a player has to consider. Computer Chinese dark chess problems can be divided into three phases: 1) the opening game, 2) the midd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991